Quantifiers in Limits
نویسنده
چکیده
The standard definition of limz→∞ F (z) = ∞ is an ∀∃∀ sentence. Mostowski showed that in the standard model of arithmetic, these quantifiers cannot be eliminated. But Abraham Robinson showed that in the nonstandard setting, this limit property for a standard function F is equivalent to the one quantifier statement that F (z) is infinite for all infinite z. In general, the number of quantifier blocks needed to define the limit depends on the underlying structure M in which one is working. Given a structure M with an ordering, we add a new function symbol F to the vocabulary of M and ask for the minimum number of quantifier blocks needed to define the class of structures (M, F ) in which limz→∞ F (z) = ∞ holds. We show that the limit cannot be defined with fewer than three quantifier blocks when the underlying structureM is either countable, special, or an o-minimal expansion of the real ordered field. But there are structures M which are so powerful that the limit property for arbitrary functions can be defined in both two-quantifier forms.
منابع مشابه
COMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING
This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...
متن کاملGrounding natural language quantifiers in visual attention
The literature on vague quantifiers in English (words like “some”, “many”, etc.) is replete with demonstrations of context effects. Yet little attention has been paid to the issue of where such effects come from. We explore the possibility that such they emanate from a visual attentional bottleneck which limits the accuracy of judgments of number in visual scenes under conditions of time pressu...
متن کاملOn residuated lattices with universal quantifiers
We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...
متن کاملبازشناسی دانش فرد خطاکار به کمک سیگنالهای تک ثبت مغزی، مبتنی بر روش غیرخطی منحنیهای بازگشتی
In this study, Recurrence Plots (RPs) has been adapted as a nonlinear approach in order to detection of guilty subjects’ knowledge based on their single-trial ERPs. The dataset were acquired from 49 human subjects who were participated in a Concealed Information Test (CIT). According to the test protocol, guilty subjects denied their information about familiar faces, so the aim was to detect th...
متن کاملCharacterizing Polynomial Ramsey Quantifiers
Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey quantifiers are either polynomial-time computable or NP-hard, and whether we can give a natural characterization of the polynomial-time computable quantifiers. In t...
متن کاملHenkin and Function Quantifiers
Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006